Architecture Alternatives for Batch Scheduling
نویسنده
چکیده
Abstract: An inappropriate architecture can have a significant negative effect on the success of a scheduling project. In development it can delay the release date, impair testability, and increase the difficulty of software maintenance. The final product can be a very slow scheduler. Even worse, it can make a scheduling problem grow until it can no longer fit in the computer. This paper walks the user through some key architecture decisions made on a large scheduling project, so that users on their own projects can make better, more informed decisions.
منابع مشابه
Coordinating Order Acceptance and Batch Delivery for an Integrated Supply Chain Scheduling
This paper develops Order Acceptance for an Integrated Production-Distribution Problem in which Batch Delivery is implemented. The aim of this problem is to coordinate: (1) rejecting some of the orders (2) production scheduling of the accepted orders and (3) batch delivery to maximize Total Net Profit. A Mixed Integer Programming is proposed for the problem. In addition, a hybrid meta-heuristic...
متن کاملRole of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm
Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملUsing Heuristic Search for Solving Single Machine Batch Processing Problems
This paper deals with scheduling for single machine batch processing, specifically the transporting problem with one vehicle. Capacity restrictions of 406 T.T. Dang, B. Frankovič, I. Budinská, B. Flood, C. Sheahan, B. L. Dang the machine are considered and the main objective is to find an assignment of jobs to achieve the minimal processing time of all batches, given these capacities. A polynom...
متن کامل